A stronger form of Neumann’s BFC-theorem

نویسندگان

چکیده

Given a group $G$, we write $x^G$ for the conjugacy class of $G$ containing element $x$. A famous theorem B. H. Neumann states that if is in which all classes are finite with bounded size, then derived $G'$ finite. We establish following result. Let $n$ be positive integer and $K$ subgroup such $|x^G|\leq n$ each $x\in K$. $H=\langle K^G\rangle$ normal closure $K$. Then order $H'$ $n$-bounded. Some corollaries this result also discussed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A stronger no-cloning theorem

It is well known that (non-orthogonal) pure states cannot be cloned so one may ask: how much or what kind of additional (quantum) information is needed to supplement one copy of a quantum state in order to be able to produce two copies of that state by a physical operation? For classical information, no supplementary information is required. However for pure quantum (non-orthogonal) states, we ...

متن کامل

A stronger form of the theorem constructing a rigid binary relation on any set

A stronger form of the theorem constructing a rigid binary relation on any set Apoloniusz Tyszka Summary. On every set A there is a rigid binary relation i.e. such a relation R ⊆ A × A that there is no homomorphism A, R → A, R except the identity (Vopěnka et al. [1965]). We prove that for each infinite cardinal number κ if card A ≤ 2 κ , then there exists a relation R ⊆ A × A with the following...

متن کامل

A weak variant of Hindman's Theorem stronger than Hilbert's Theorem

Hirst investigated a slight variant of Hindman's Finite Sums Theorem called Hilbert's Theorem and proved it equivalent over RCA0 to the In nite Pigeonhole Principle for all colors. This gave the rst example of a natural restriction of Hindman's Theorem provably much weaker than Hindman's Theorem itself. We here introduce another natural variant of Hindman's Theorem which we name the Adjacent Hi...

متن کامل

ul 2 00 1 A stronger form of the theorem constructing a rigid binary relation on any set

On every set A there is a rigid binary relation i.e. such a relation R ⊆ A × A that there is no homomorphism (A,R) → (A,R) except the identity (Vopěnka et al. [1965]). We prove that for each infinite cardinal number κ if card A ≤ 2 then there exists a relation R ⊆ A×A with the following property ∀ x 6=y ∃ {x}⊆A(x,y)⊆A cardA(x,y)≤κ ∀ f :A(x,y)→A f(x)=y f is not a homomorphism of R which implies ...

متن کامل

A stronger version of Bárány's theorem in the plane

First, we may assume, without loss of generality, that the points of the sets ƒ > > are located on the unit circle, by projecting these points on the circumference of the circle. Second, by Carathéodory Theorem (see [3]), we may assume, without loss of generality, that the cardinality of each set + is at most ? , for 4„5X2= >8 @? . In fact, we can further assume that * + *…5†? , for 4„5X2' 98( ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2021

ISSN: ['1565-8511', '0021-2172']

DOI: https://doi.org/10.1007/s11856-021-2133-1